منابع مشابه
Research on Clustering Algorithm Based on Grid Density on Uncertain Data Stream
To solve the clustering algorithm based on grid density on uncertain data stream in adjustment cycle for clustering omissions, the paper proposed an algorithm, named GCUDS, to cluster uncertain data steam using grid structure. The concept of the data trend degree was defined to describe the grade of a data point belonging to some grid unit and the defect of information loss around grid units wa...
متن کاملProbability Density Grid-based Online Clustering for Uncertain Data Streams
Most existing stream clustering algorithms adopt the online component and offline component. The disadvantage of two-phase algorithms is that they can not generate the final clusters online and the accurate clustering results need to be got through the offline analysis. Furthermore, the clustering algorithms for uncertain data streams are incompetent to find clusters of arbitrary shapes accordi...
متن کاملClustering and Classification on Uncertain Data
We study the problem of mining on uncertain objects whose locations are uncertain and described by probability density functions (pdf). Clustering and classification are two important tasks in data mining. Clustering on uncertain objects is different from traditional case on certain objects. UK-means is proposed based on K-means but it is time consuming. Pruning techniques are proposed to impro...
متن کاملOn Clustering Algorithms for Uncertain Data
In this chapter, we will study the clustering problem for uncertain data. When information about the data uncertainty is available, it can be leveraged in order to improve the quality of the underlying results. We will provide a survey of the different algorithms for clustering uncertain data. This includes recent algorithms for clustering static data sets, as well as the algorithms for cluster...
متن کاملDAGger: Clustering Correlated Uncertain Data
◮ It can compute exact and approximate probabilities with error guarantees for the clustering output. State-of-the-art techniques (e.g. UK-means, UKmedoids, MMVar): ◮ do not support the possible worlds semantics, ◮ lack support for correlations and assume probabilistic independence, ◮ use deterministic cluster medoids or expected means, and ◮ can only compute clustering based on expected distan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2019
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1189/1/012025